Technical Report UW-CSE-11-03-01 Parallel Evaluation of Conjunctive Queries
نویسندگان
چکیده
The availability of large data centers with tens of thousands of servers has led to the popular adoption of massive parallelism for data analysis on large datasets. Several query languages exist for running queries on massively parallel architectures, some based on the MapReduce infrastructure, others using proprietary implementations. Motivated by this trend, this paper analyzes the parallel complexity of conjunctive queries. We propose a very simple model of parallel computation that captures these architectures, in which the complexity parameter is the number of parallel steps requiring synchronization of all servers. We study the complexity of conjunctive queries and give a complete characterization of the queries which can be computed in one parallel step. These form a strict subset of hierarchical queries, and include flat queries like R(x, y), S(x, z), T (x, v), U(x,w), tall queries like R(x), S(x, y), T (x, y, z), U(x, y, z, w), and combinations thereof, which we call tall-flat queries. We describe an algorithm for computing in parallel any tall-flat query, and prove that any query that is not tall-flat cannot be computed in one step in this model. Finally, we present extensions of our results to queries that are not tall-flat.
منابع مشابه
Technical Report UW-CSE-12-03-02 Query-Based Data Pricing
Increasingly, data is being bought and sold online, and Web-based marketplace services have emerged to facilitate selling and buying data. Current pricing mechanisms, however, are very simple, providing a fixed set of views, each with a specific price. In this paper, we propose a framework for pricing data on the Internet that allows the seller to set explicit prices for only a few views, yet a...
متن کاملTechnical Note: BIRN-DI-TN-2003-01 Query Containment, Minimization, and Semantic Optimization of Conjunctive Queries (or: More on Uncles and Aunts)
This technical note presents the ubiquitous problem of query containment for conjunctive queries (an NP-complete problem), and an elegant implementation CQCP of Conjunctive Query Containment in Prolog, in just 7 lines of code. We also describe two important applications of conjunctive query containment: semantic query optimization and minimization. The latter can be implemented by another conci...
متن کاملUW CSE Technical Report 02-07-03 Temporal Sequence Learning With Dynamic Synapses
Recent results indicate that neocortical synapses exhibit both short-term plasticity and long-term spike-timing dependent plasticity. It has been suggested that changes in short-term plasticity are mediated by a redistribution of synaptic efficacy. This paper investigates how learning rules based on redistribution of synaptic efficacy can allow individual neurons and small networks of neurons t...
متن کاملUW CSE Technical Report 03-06-01 Probabilistic Bilinear Models for Appearance-Based Vision
We present a probabilistic approach to learning object representations based on the “content and style” bilinear generative model of Tenenbaum and Freeman. In contrast to their earlier SVD-based approach, our approach models images using particle filters. We maintain separate particle filters to represent the content and style spaces, allowing us to define arbitrary weighting functions over the...
متن کاملLearning in First-Order Probabilistic Representations
Learning probabilistic models has been an important direction of research in the machine learning community, as has been learning first-order logic models. Ideally, we would like to be able to combine the two, i.e., to learn first-order probabilistic models. Because of their ability to handle uncertainty and compactly model complex domains, these models are the object of growing research intere...
متن کامل